Rendezvous with reality

Fast Rendezvous with Advice

Two mobile agents (robots), starting from different nodes of an n-node network at possibly different times, have to meet at the same node. This problem is known as rendezvous. Agents move in synchronous rounds using a deterministic algorithm. In each round, an agent decides to either remain idle or to move to one of the adjacent nodes. Each agent has a distinct integer label from the set {1, . ...

Rendezvous with constant memory

We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without additional assumptions, rendezvous is impossible if the entities are oblivious (i.e., have no persistent memory) even if the system is semi-synchronous (SSynch). It has been recently shown that rendezvous is possible...

William Beaumont's Rendezvous with Fame *

Performance Bounds for Concurrent Software with Rendezvous

Synchronous message-passing communication, or rendezvous, occurring between software tasks can have a signiicant eeect on system performance. The rendezvous style of communication is coming into wider use in programming languages and operating systems for parallel and distributed environments. Understanding the performance implications of this style of inter-task communication is becoming a mat...

Development and Testing of a Virtual Reality Testbed for Camera Simulation in Rendezvous and Docking Scenarios

The Virtual Space Robotics Testbed serves as a decision support system in various space mission scenarios mostly rendezvous and docking (RvD), planetary landing and exploration. Therefore, various tests with real and virtual hardware were made in the testbed for rendezvous and capture (INVERITAS). Our simulation system allows the generation of virtual images and the test of virtual camera syste...